Constructive root bound for k-ary rational input numbers
نویسندگان
چکیده
منابع مشابه
k-Automatic Sets of Rational Numbers
The notion of a k-automatic set of integers is well-studied. We develop a new notion — the k-automatic set of rational numbers — and prove basic properties of these sets, including closure properties and decidability.
متن کاملOn the $k$-ary Moment Map
The moment map is a mathematical expression of the concept of the conservation associated with the symmetries of a Hamiltonian system. The abstract moment map is defined from G-manifold M to dual Lie algebra of G. We will interested study maps from G-manifold M to spaces that are more general than dual Lie algebra of G. These maps help us to reduce the dimension of a manifold much more.
متن کاملRoot numbers and rational points on elliptic curves
This article is broadly based on the talk that was given at the symposium ‘Perspectives in the Mathematical Sciences’, held at Indian Statistical Institute (ISI), Bangalore, to celebrate the Platinum Jubilee of the ISI. I would like to thank the organisers, especially Professor N.S.N. Sastry, for inviting me to lecture on this occasion. The article is intended for a general audience and does no...
متن کاملBranches in random recursive k-ary trees
In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
متن کاملThe Constructive Real Numbers
Dr. Mark Bickford will discuss his implementation of the constructive reals in Nuprl, and we will discuss their significance both in practical applications and in the development of type theory. Supplementary material for this lecture is written by Dr. Bickford and included on the course web page for Lectures 16 and 17. He will also discuss his very insightful new result about the connectedness...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.09.010